我们旨在使用大量自动转录语音来改进口语建模（LM）。我们利用INA（法国国家视听学院）的收藏，并在350,000小时的电视节目中应用ASR后获得19GB的文本。由此，通过微调现有的LM（FLAUBERT）或通过从头开始训练LM来培训口语模型。新模型（Flaubert-Oral）与社区共享，并评估了3个下游任务：口语理解，电视节目的分类和语音句法解析。结果表明，与最初的Flaubert版本相比，Flaubert-Oral可能是有益的，表明尽管其固有的嘈杂性，但ASR生成的文本仍可用于构建口头语言模型。

NLP（例如基于过渡的解析）的贪婪算法容易出现误差传播。克服这个问题的一种方法是允许算法回溯并探索替代解决方案，在新证据与迄今为止探索的解决方案相矛盾的情况下。为了实施这种行为，我们使用增强学习，并在此操作获得更好的奖励的情况下让算法回溯，而不是继续探索当前的解决方案。我们在POS标签和依赖解析上测试了这一想法，并表明回溯是反对错误传播的有效手段。

In inverse reinforcement learning (IRL), a learning agent infers a reward function encoding the underlying task using demonstrations from experts. However, many existing IRL techniques make the often unrealistic assumption that the agent has access to full information about the environment. We remove this assumption by developing an algorithm for IRL in partially observable Markov decision processes (POMDPs). We address two limitations of existing IRL techniques. First, they require an excessive amount of data due to the information asymmetry between the expert and the learner. Second, most of these IRL techniques require solving the computationally intractable forward problem -- computing an optimal policy given a reward function -- in POMDPs. The developed algorithm reduces the information asymmetry while increasing the data efficiency by incorporating task specifications expressed in temporal logic into IRL. Such specifications may be interpreted as side information available to the learner a priori in addition to the demonstrations. Further, the algorithm avoids a common source of algorithmic complexity by building on causal entropy as the measure of the likelihood of the demonstrations as opposed to entropy. Nevertheless, the resulting problem is nonconvex due to the so-called forward problem. We solve the intrinsic nonconvexity of the forward problem in a scalable manner through a sequential linear programming scheme that guarantees to converge to a locally optimal policy. In a series of examples, including experiments in a high-fidelity Unity simulator, we demonstrate that even with a limited amount of data and POMDPs with tens of thousands of states, our algorithm learns reward functions and policies that satisfy the task while inducing similar behavior to the expert by leveraging the provided side information.

Event Detection (ED) is the task of identifying and classifying trigger words of event mentions in text. Despite considerable research efforts in recent years for English text, the task of ED in other languages has been significantly less explored. Switching to non-English languages, important research questions for ED include how well existing ED models perform on different languages, how challenging ED is in other languages, and how well ED knowledge and annotation can be transferred across languages. To answer those questions, it is crucial to obtain multilingual ED datasets that provide consistent event annotation for multiple languages. There exist some multilingual ED datasets; however, they tend to cover a handful of languages and mainly focus on popular ones. Many languages are not covered in existing multilingual ED datasets. In addition, the current datasets are often small and not accessible to the public. To overcome those shortcomings, we introduce a new large-scale multilingual dataset for ED (called MINION) that consistently annotates events for 8 different languages; 5 of them have not been supported by existing multilingual datasets. We also perform extensive experiments and analysis to demonstrate the challenges and transferability of ED across languages in MINION that in all call for more research effort in this area.

Event Extraction (EE) is one of the fundamental tasks in Information Extraction (IE) that aims to recognize event mentions and their arguments (i.e., participants) from text. Due to its importance, extensive methods and resources have been developed for Event Extraction. However, one limitation of current research for EE involves the under-exploration for non-English languages in which the lack of high-quality multilingual EE datasets for model training and evaluation has been the main hindrance. To address this limitation, we propose a novel Multilingual Event Extraction dataset (MEE) that provides annotation for more than 50K event mentions in 8 typologically different languages. MEE comprehensively annotates data for entity mentions, event triggers and event arguments. We conduct extensive experiments on the proposed dataset to reveal challenges and opportunities for multilingual EE.

In this paper, we introduce a novel concept of user-entity differential privacy (UeDP) to provide formal privacy protection simultaneously to both sensitive entities in textual data and data owners in learning natural language models (NLMs). To preserve UeDP, we developed a novel algorithm, called UeDP-Alg, optimizing the trade-off between privacy loss and model utility with a tight sensitivity bound derived from seamlessly combining user and sensitive entity sampling processes. An extensive theoretical analysis and evaluation show that our UeDP-Alg outperforms baseline approaches in model utility under the same privacy budget consumption on several NLM tasks, using benchmark datasets.

流视频是创作者与观众分享创意作品的方法之一。在这些视频中，流媒体分享了如何通过在一个或几个用于创意项目的程序中使用各种工具来实现最终目标。为此，可以讨论实现最终目标所需的步骤。因此，这些视频可以提供大量的教育内容，这些内容可用于学习如何使用流媒体使用的工具。但是，缺点之一是，流媒体可能无法为每个步骤提供足够的详细信息。因此，对于学习者来说，可能很难赶上所有步骤。为了减轻此问题，一种解决方案是将流视频与流视频中使用的工具可用的相关教程联系起来。更具体地说，系统可以分析实时流媒体视频的内容，并推荐最相关的教程。由于现有的文档推荐模型无法处理这种情况，因此在这项工作中，我们为实时流程视频的教程建议提供了一个新颖的数据集和模型。我们对拟议的数据集和模型进行了广泛的分析，揭示了该任务的挑战性质。

键形提取是NLP中文档理解的重要任务之一。虽然大多数先前的作品都致力于正式设置，例如书籍，新闻或网络博客，但探索视频成绩单等非正式文本的探索较少。为了解决这一局限性，在这项工作中，我们提出了一种新颖的语料库和方法，用于从Behance平台上流的视频的成绩单中提取钥匙短语。更具体地说，在这项工作中，提出了一种新型的数据增强，以通过从其他域中提取键形提取任务的背景知识来丰富模型。提出的数据集数据集上的广泛实验显示了引入方法的有效性。

即使有效，模型的使用也必须伴随着转换数据的各个级别的理解（上游和下游）。因此，需求增加以定义单个数据与算法可以根据其分析可以做出的选择（例如，一种产品或一种促销报价的建议，或代表风险的保险费率）。模型用户必须确保模型不会区分，并且也可以解释其结果。本文介绍了模型解释的重要性，并解决了模型透明度的概念。在保险环境中，它专门说明了如何使用某些工具来强制执行当今可以利用机器学习的精算模型的控制。在一个简单的汽车保险中损失频率估计的示例中，我们展示了一些解释性方法的兴趣，以适应目标受众的解释。

我们重新审视NPBG，这是一种流行的新型视图合成方法，引入了无处不在的点神经渲染范式。我们对具有快速视图合成的数据效率学习特别感兴趣。除前景/背景场景渲染分裂以及改善的损失外，我们还通过基于视图的网状点描述符栅格化来实现这一目标。通过仅在一个场景上训练，我们的表现就超过了在扫描仪上接受过培训的NPBG，然后进行了填充场景。我们还针对最先进的方法SVS进行了竞争性，该方法已在完整的数据集（DTU，坦克和寺庙）上进行了培训，然后进行了对现场的培训，尽管它们具有更深的神经渲染器。